Probabilistic Borda rule voting

نویسنده

  • Jac C. Heckelman
چکیده

An alternative voting system, referred to as probabilistic Borda rule, is developed and analyzed. The winning alternative under this system is chosen by lottery where the weights are determined from each alternative’s Borda score relative to all Borda points possible. Advantages of the lottery include the elimination of strategic voting on the set of alternatives under consideration and breaking the tyranny of majority coalitions. Disadvantages include an increased incentive for strategic introduction of new alternatives to alter the lottery weights, and the possible selection of a Condorcet loser. Normative axiomatic properties of the system are also considered. It is shown this system satisfies the axiomatic properties of the standard Borda procedure in a probabilistic fashion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack

Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...

متن کامل

Complexity of and algorithms for the manipulation of Borda, Nanson's and Baldwin's voting rules

We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson’s and Baldwin’s voting rules, which are based on Borda voting. We argue that these rules have a number of desirable computational properties. For unweighted Borda voting, we prove that it is NP-hard for a coalition of two manipulators to compute a manipulation. This resolves a long-standi...

متن کامل

The Borda Count and Dominance Solvable Voting Games

We analyse dominance solvability (by iterated elimination of weakly dominated strategies) of voting games with three candidates and provide sufficient and necessary conditions for the Borda Count to yield a unique winner. We find that Borda is the unique scoring rule that is dominance solvable both (i) under unanimous agreement on a best candidate and (ii) under unanimous agreement on a worst c...

متن کامل

Voting Systems and Strategic Manipulation: an Experimental Study

This paper presents experiments analyzing the strategic behavior of voters under three voting systems: plurality rule, approval voting, and the Borda count. Strategic behavior is significantly different under each treatment (voting system). Plurality rule leads voters to play in a more sophisticated manner, but not necessarily insincerely, displaying the lowest levels of manipulation. The oppos...

متن کامل

On the stability of a scoring rules set under the IAC

A society facing a choice problem has also to choose the voting rule itself from a set of different possible voting rules. In such situations, the consequentialism property allows us to induce voters’ preferences on voting rules from preferences over alternatives. A voting rule employed to resolve the society’s choice problem is self-selective if it chooses itself when it is also used in choosi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Social Choice and Welfare

دوره 21  شماره 

صفحات  -

تاریخ انتشار 2003